package btree.traversal;

public class main {
   public static void main(String[] args){
	   TreeNode a = new TreeNode(null,null,4);
	   TreeNode b= new TreeNode(null,null,9);
	   TreeNode c= new TreeNode(a,b,1);
	   TreeNode d= new TreeNode(null,null,8);
	   TreeNode e= new TreeNode(null,d,3);
	   TreeNode f= new TreeNode(null,null,6);
	   TreeNode g= new TreeNode(c,e,2);
	   TreeNode h= new TreeNode(g,f,7);
	   
	   Traversal t = new Traversal();
	   t.preOrderRecursion(h);
       t.postOrderRecursion(h);
     
   }
}
